Fibonacci-like behavior of the number of numerical semigroups of a given genus
نویسندگان
چکیده
We conjecture a Fibonacci-like property on the number of numerical semigroups of a given genus. Moreover we conjecture that the associated quotient sequence approaches the golden ratio. The conjecture is motivated by the results on the number of semigroups of genus at most 50. The Wilf conjecture has also been checked for all numerical semigroups with genus in the same range.
منابع مشابه
Bounds on the Number of Numerical Semigroups of a Given Genus
Combinatorics on multisets is used to deduce new upper and lower bounds on the number of numerical semigroups of each given genus, significantly improving existing ones. In particular, it is proved that the number ng of numerical semigroups of genus g satisfies 2Fg 6 ng 6 1 + 3 · 2 , where Fg denotes the gth Fibonacci number.
متن کاملImproved Bounds on the Number of Numerical Semigroups of a given Genus
We improve the previously best known lower and upper bounds on the number ng of numerical semigroups of genus g. Starting from a known recursive description of the tree T of numerical semigroups, we analyze some of its properties and use them to construct approximations of T by generating trees whose nodes are labeled by certain parameters of the semigroups. We then translate the succession rul...
متن کاملCounting Numerical Semigroups by Genus and Some Cases of a Question of Wilf
The genus of a numerical semigroup is the size of its complement. In this paper we will prove some results about counting numerical semigroups by genus. In 2008, Bras-Amorós conjectured that the ratio between the number of semigroups of genus g + 1 and the number of semigroups of genus g approaches φ, the golden ratio, as g gets large. Though several recent papers have provided bounds for count...
متن کاملTowards a Better Understanding of the Semigroup Tree
In this paper we elaborate on the structure of the semigroup tree and the regularities on the number of descendants of each node observed in [2]. These regularites admit two different types of behavior and in this work we investigate which of the two types takes place in particular for well-known classes of semigroups. Also we study the question of what kind of chains appear in the tree and cha...
متن کاملFrobenius numbers of generalized Fibonacci semigroups
The numerical semigroup generated by relatively prime positive integers a1, . . . , an is the set S of all linear combinations of a1, . . . , an with nonnegative integral coefficients. The largest integer which is not an element of S is called the Frobenius number of S. Recently, J. M. Maŕın, J. L. Ramı́rez Alfonśın, and M. P. Revuelta determined the Frobenius number of a Fibonacci semigroup, th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008